Section: New Software and Platforms

Mætning

Keywords: Automated Theorem Proving - Intuitionistic Logic

Functional Description

Mætning is an automated theorem prover for first-order intuitionistic logic that is particularly suited for efficiently finding disproofs, i.e., for establishing that a given goal query is not provable. It is based on the focused inverse method  [54] [74] , but augmented by a mechanism for building finite approximations for infinite search spaces that nevertheless guarantee soundness of a disproof.

Mætning has been released under the terms of the MIT license.

• Participants: Taus Brock-Nannestad, Kaustuv Chaudhuri

• Contact: Kaustuv Chaudhuri

• URL: https://github.com/chaudhuri/maetning